Marginal Inference in Continuous Markov Random Fields Using Mixtures
نویسندگان
چکیده
منابع مشابه
Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials
In this paper, we prove that every multivariate polynomial with even degree can be decomposed into a sum of convex and concave polynomials. Motivated by this property, we exploit the concave-convex procedure to perform inference on continuous Markov random fields with polynomial potentials. In particular, we show that the concave-convex decomposition of polynomials can be expressed as a sum-of-...
متن کاملTEKNISK - NATURVITENSKAPELIGE UNIVERSITET Marginal Variances for Gaussian Markov Random Fields
Gaussian Markov random fields (GMRFs) are specified conditionally by its precision matrix meaning that its inverse, the covariance matrix, is not explicitly known. Computing the often dense covariance matrix directly using matrix inversion is often unfeasible due to time and memory requirement. In this note, we discuss a simple and fast algorithm to compute the marginal variances for a GMRF. We...
متن کاملStacked Graphical Models for Efficient Inference in Markov Random Fields
In collective classification, classes are predicted simultaneously for a group of related instances, rather than predicting a class for each instance separately. Collective classification has been widely used for classification on relational datasets. However, the inference procedure used in collective classification usually requires many iterations and thus is expensive. We propose stacked gra...
متن کاملTemplate Based Inference in Symmetric Relational Markov Random Fields
Relational Markov Random Fields are a general and flexible framework for reasoning about the joint distribution over attributes of a large number of interacting entities. The main computational difficulty in learning such models is inference. Even when dealing with complete data, where one can summarize a large domain by sufficient statistics, learning requires one to compute the expectation of...
متن کاملScaling MPE Inference for Constrained Continuous Markov Random Fields with Consensus Optimization
Probabilistic graphical models are powerful tools for analyzing constrained, continuous domains. However, finding most-probable explanations (MPEs) in these models can be computationally expensive. In this paper, we improve the scalability of MPE inference in a class of graphical models with piecewise-linear and piecewise-quadratic dependencies and linear constraints over continuous domains. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33017834